A Fully Lexicalized Grammar for French Based on Meaning-Text Theory (Invited Talk)
نویسنده
چکیده
The paper presents a formal lexicalized dependency grammar based on Meaning-Text theory. This grammar associates semantic graphs with sentences. We propose a fragment of a grammar for French, including the description of extractions. The main particularity of our grammar is it that it builds bubble trees as syntactic representations, that is, trees whose nodes can be filled by bubbles, which can contain others nodes. Our grammar needs more complex operations of combination of elementary structures than other lexicalized grammars, such as TAG or CG, but avoids the multiplication of elementary structures and provides linguistically well-motivated treatments. 1 I n t r o d u c t i o n Meaning-Text theory (MTT) has been developed since more than thirty years, but no complete formalization of the model has been achieved. Our main goal in this paper is to propose a formal grammar based on MTT. We insist on the fact that our grammar in any case is a ‘kosher’ implementation of MTT. Following the MTT postulates ([16]: 53), we consider that 1) a grammar is a formal system which ensures the bidirectional correspondence between texts and meanings (= semantic representations) and that 2) intermediate levels of representation—a morphological level and a syntactic level—must be considered and that a grammar consists of several modules which establish correspondence between representations of adjacent levels. Our grammar is composed of three modules: the morphological module ensures the correspondence between sentences and morphological representations, the syntactic module ensures the correspondence between morphological and syntactic representations and the semantic module ensures the correspondence between syntactic and semantic representations. In section 2, we present the different levels of representation, in section 3, the syntactic module and in section 4, the semantic module. Our formalism will be exem1 I want to thank Jasmina Milievi, as well as two anonymous referees, for many valuable comments and corrections. 2 The term grammar is used in its Chomskian sense of ‘linguistic model’.
منابع مشابه
Enriching Lexical Transfer With Cross-Linguistic Semantic Features or How to Do Interlingua without Interlingua
In this paper, we propose an alternative to interlingua which can capture the analyses and generalizations that interlinguas can express, but which uses cross-linguistic semantic features rather than a separate level of representation. This alternative we call lexico-structural transfer. Lexico-structural transfer relies on the expressive power of a lexicalized syntactic representation (or “lex...
متن کاملDeriving Information Structure from Prosodically Marked Text with Lexicalized Tree Adjoining Grammars
This paper proposes a method for integrating intonation and information structure into the Lexicalized Tree Adjoining Grammar (LTAG) formalism. The method works fully within LTAG and requires no changes or additions to the basic formalism. From the existing CCG analysis, we denote boundary tones as lexical items and pitch accents as features of lexical items. We then show how prosodically marke...
متن کاملDeterministic Word Segmentation Using Maximum Matching with Fully Lexicalized Rules
We present a fast algorithm of word segmentation that scans an input sentence in a deterministic manner just one time. The algorithm is based on simple maximum matching which includes execution of fully lexicalized transformational rules. Since the process of rule matching is incorporated into dictionary lookup, fast segmentation is achieved. We evaluated the proposed method on word segmentatio...
متن کاملThings between Lexicon and Grammar
A number of grammar formalisms were proposed in 80’s, such as Lexical Functional Grammars, Generalized Phrase Structure Grammars, and Tree Adjoining Grammars. Those formalisms then started to put a stress on lexicon, and were called as lexicalist (or lexicalized) grammars. Representative examples of lexicalist grammars were Head-driven Phrase Structure Grammars (HPSG) and Lexicalized Tree Adjoi...
متن کاملSome Experiments on Indicators of Parsing Complexity for Lexicalized Grammars
In this paper, we identify syntactic lexical ambiguity and sentence complexity as factors that contribute to parsing complexity in fully lexicalized grammar formalisms such as Lexicalized Tree Adjoining Grammars. We also report on experiments that explore the effects of these factors on parsing complexity. We discuss how these constraints can be exploited in improving efficiency of parsers for ...
متن کامل